منابع مشابه
On Chromatic Uniqueness of a Family of K4-Homeomorphs II
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H |H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. A K4-homeomorph denoted by K4(a, b, c, d, e, f) if the six edges of complete graph K4 are replaced by the six paths of length a, b, c, d, e, f respectively. In th...
متن کاملOn Chromatic Equivalence Pair of a Family of K4-Homeomorphs
In this paper, we discuss a pair of chromatically equivalent of K4-homeomorphs of girth 11, that is, K4(1, 3, 7, d, e, f) and K4(1, 3, 7, d′, e′, f ′). As a result, we obtain two infinite chromatically equivalent non-isomorphic K4-homeomorphs. Mathematical Subject Classification: 05C15
متن کاملChromatic uniqueness of a family of K4-homeomorphs
In this paper, we study the chromatic uniqueness of one family of K4-homeomorphs with girth 10. 2000 Mathematical Subject Classification. Primary 05C15.
متن کاملOn Chromatic Uniqueness of a Family of K4-Homeomorphs
In this paper, we study the chromatic uniqueness of one family of K4-homeomorphs with girth 10. 2000 Mathematics Subject Classification: 05C15
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90346-u